Real-time scheduling for systems with precedence, periodicity and latency constraints

First we present the main results concerning, in the one hand systems with periodicity constraints and deadlines, and in the other hand systems with precedence constraints and deadlines, in both cases for one computing resource. Then, we give a model in order to state clearly the problem for scheduling systems with precedence, periodicity and latency constraints. In order to solve this problem we give a nonpreemptive, off-line scheduling algorithm which uses in turn an algorithm of latency marking. We demonstrate the optimality of the scheduling algorithm, and after proving the equivalence of the notions of latency constraint and deadline, we extend this latter algorithm for scheduling realtime systems with precedence, periodicity constraints and deadlines for one computing resource.